Stacked 4-polytopes with Ball Packable Graphs
نویسنده
چکیده
After investigating the ball-packability of some small graphs, we give a full characterisation, in terms of forbidden induced subgraphs, for the stacked 4-polytopes whose 1-skeletons can be realised by the tangency relations of a ball packing.
منابع مشابه
Treetopes and their Graphs
We define treetopes, a generalization of the threedimensional roofless polyhedra (Halin graphs) to arbitrary dimensions. Like roofless polyhedra, treetopes have a designated base facet such that every face of dimension greater than one intersects the base in more than one point. We prove an equivalent characterization of the 4-treetopes using the concept of clustered planarity from graph drawin...
متن کاملSolving multiobjective linear programming problems using ball center of polytopes
Here, we aim to develop a new algorithm for solving a multiobjective linear programming problem. The algorithm is to obtain a solution which approximately meets the decision maker's preferences. It is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution. Numerical examples and a simulation study are used to illu...
متن کاملA short update on equipackable graphs
A graph is called equipackable if every maximal packing in it is also maximum. This generalizes randomly packable graphs. We survey known results both on randomly packable graphs and on equipackable graphs. As a new result is given a characterization of P3-equipackable graphs with all valencies at least two.
متن کاملSparse graphs of girth at least five are packable
A graph is packable if it is a subgraph of its complement. The following statement was conjectured by Faudree, Rousseau, Schelp and Schuster in 1981: every non-star graph G with girth at least 5 is packable. The conjecture was proved by Faudree et al. with the additional condition that G has at most 5n − 2 edges. In this paper, for each integer k ≥ 3, we prove that every non-star graphwith girt...
متن کاملOn maximum spanning tree-packable graphs and uncoverings-by-bases
We define an uncovering-by-bases for a connected graph G to be a collection U of spanning trees for G such that any t-subset of edges of G is disjoint from at least one tree in U , where t is some integer strictly less than the edge connectivity of G. We construct examples of these for some infinite families of graphs. We then characterize maximum spanning tree-packable graphs, i.e. those graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013